Finite Difference Methods for Linear Shape from Shading

This paper presents and analyzes four finite difference methods for linear shape from shading problem. Comparisons of accuracy, solvability, stability and convergence of these methods indicate that the weighted semi-implicit method and the box method are better than the other ones because they are easily calculated, more accurate, faster in convergence and unconditionally stable. 1 Center for Image Technology and Robotics Tamaki Campus, The University of Auckland, Auckland, New Zealand. [email protected] and [email protected] You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the CITR Tamaki web site under terms that include this permission. All other rights are reserved by the author(s). Finite Difference Methods for Linear Shape from Shading Tiangong Wei and Reinhard Klette CITR, Department of Computer Science,Tamaki Campus The University of Auckland, Private Bag 92019, Auckland, New Zealand Email: ftiangong, [email protected]